Some Comments on the Stochastic Eulerian Tour Problem
نویسنده
چکیده
The Stochastic Eulerian Tour Problem was introduced in 2008 [1] as a stochastic variant of the well-known Eulerian Tour Problem. In a follow-up paper the same authors investigated some heuristics for solving the Stochastic Eulerian Tour Problem [2]. After a thorough study of these two publications a few issues emerged. In this short research commentary we would like to discuss these issues. For this purpose, we will first introduce the Stochastic Eulerian Tour Problem using the original formulation of [1]. Afterwards we will discuss the following issues more in detail:
منابع مشابه
The Stochastic Eulerian Tour Problem
This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an undirected Eulerian graph , a subset =) of the edges in E that require service, and a probability distribution for the number of edges in R that have to be visited in any given instance of the graph, the SETP seeks an a priori Eulerian tour of minimum expected length...
متن کاملHeuristics for the Stochastic Eulerian Tour Problem
The Stochastic Eulerian Tour Problem (SETP) seeks the Eulerian tour of minimum expected length on an undirected Eulerian graph, when demand on the arcs that have to be serviced is probabilistic. In an earlier paper, we have shown that the SETP is NP-hard and derived several properties of the optimal tour. In this paper, we develop three constructive heuristics for the SETP. The first two are gr...
متن کاملA hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملA 4/3-approximation for TSP on cubic 3-edge-connected graphs
We consider the travelling salesman problem on metrics which can be viewed as the shortest path metric of an undirected graph with unit edge-lengths. Finding a TSP tour in such a metric is then equivalent to finding a connected Eulerian subgraph in the underlying graph. Since the length of the tour is the number of edges in this Eulerian subgraph our problem can equivalently be stated as follow...
متن کاملOn the optimality of a simple strategy for searching graphs
Consider a search game with an immobile hider in a graph. A Chinese postman tour is a closed trajectory which visits all the points of the graph and has minimal length. We show that encircling the Chinese postman tour in a random direction is an optimal search strategy if and only if the graph is weakly Eulerian (i.e it consists of several Eulerian curves connected in a tree-like structure).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.04177 شماره
صفحات -
تاریخ انتشار 2015